Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers
نویسندگان
چکیده
Half-arc-transitive graphs are a fascinating topic which connects graph theory, Riemann surfaces and group theory. Although fruitful results have been obtained over the last half century, it is still challenging to construct half-arc-transitive with prescribed vertex stabilizers. Until recently, there only six known connected tetravalent nonabelian stabilizers, question whether exists stabilizer of order 2s for every s⩾3 has wide open. This answered in affirmative this paper via construction D82×C2m each integer m⩾1, where D82 direct product two copies dihedral 8 C2m m cyclic 2. The constructed surprisingly many significant properties various contexts.
منابع مشابه
Quartic half-arc-transitive graphs with large vertex stabilizers
A 1 2 -arc-transitive graph is a vertexand edgebut not arc-transitive graph. In all known constructions of quartic 1 2 -arc-transitive graphs, vertex stabilizers are isomorphic to Z 2,Z 2 2 or to D8. In this article, for each positive integer m ≥ 1, an infinite family of quartic 1 2 -arctransitive graphs having vertex stabilizers isomorphic to Z m
متن کاملTetravalent half-arc-transitive graphs of order p4
A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arctransitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p − 1 is divisible by 8 and it is unique for a given o...
متن کاملA tetravalent half-arc-transitive graph with non-abelian vertex stabilizer
A construction is given of a valent arc transitive graph with vertex stabilizer isomorphic to the dihedral group D The graph has vertices and is the rst known example of a valent arc transitive graph with nonabelian vertex stabilizer A VALENT HALF ARC TRANSITIVE GRAPH
متن کاملArc-transitive cycle decompositions of tetravalent graphs
A cycle decomposition of a graph Γ is a set C of cycles of Γ such that every edge of Γ belongs to exactly one cycle in C. Such a decomposition is called arc-transitive if the group of automorphisms of Γ that preserve C setwise acts transitively on the arcs of Γ . In this paper, we study arc-transitive cycle decompositions of tetravalent graphs. In particular, we are interested in determining an...
متن کاملTetravalent arc-transitive graphs of order 3p2
Let s be a positive integer. A graph is s-transitive if its automorphism group is transitive on s-arcs but not on (s + 1)-arcs. Let p be a prime. In this article a complete classification of tetravalent s-transitive graphs of order 3p is given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2021
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2020.12.001